Precise and Scalable Analysis of Programs with Callbacks
نویسنده
چکیده
Our work is in the area of automated verification of software properties in modern programing languages. We present three papers related to various aspects of our research field: a modular pointer and effect analysis for object oriented programs, a precise and efficient typestate analysis, and a precise, parametric array content analysis. We discuss their contributions as well as their shortcomings. Finally, we present our recent work on analyzing software with complex, dynamic properties, and discuss ideas for future research.
منابع مشابه
On Effect Analysis for Programs with Callbacks
We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number of targets is very large. This feature makes our analysis appropriate for programs that manipulate first-class functions (callbacks). We first...
متن کاملEffect Analysis for Programs with Callbacks
We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number of targets is very large. This feature makes our analysis appropriate for programs that manipulate first-class functions (callbacks). We prese...
متن کاملAn extensible declarative classification framework and its efficient implementation (Draft)
We design a generic declarative framework for classification of objects in imperative languages, which allows for arbitrary extensions through callbacks to procedural code. Our work is inspired by some more general tools for knowledge representation, such as prioritized extended datalog programs ([9], [6]). We also outline an efficient and scalable algorithm for evaluating our programs, which i...
متن کاملModular Heap Analysis for Higher-Order Programs
We consider the problem of computing summaries for procedures that soundly capture the effect of calling a procedure on program state that includes a mutable heap. Such summaries are the basis for a compositional program analysis and key to scalability. Higher order procedures contain callbacks (indirect calls to procedures specified by callers). The use of such callbacks and higherorder featur...
متن کاملEdgeMiner: Automatically Detecting Implicit Control Flow Transitions through the Android Framework
A wealth of recent research proposes static data flow analysis for the security analysis of Android applications. One of the building blocks that these analysis systems rely upon is the computation of a precise control flow graph. The callback mechanism provided and orchestrated by the Android framework makes the correct generation of the control flow graph a challenging endeavor. From the anal...
متن کامل